#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    bool vis[50][50];
    int dx[4] = { 0, 0, 1, -1 };
    int dy[4] = { 1, -1, 0, 0 };
    int ret, m, n;
    typedef pair<int, int> PII;
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        m = grid.size(), n = grid[0].size();
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (grid[i][j] == 1 && !vis[i][j]) {
                    cout << i << ' ' << j << ' ' << endl;

                    bfs(grid, i, j);
                }
            }
        }
        return ret;
    }
    void bfs(vector<vector<int>>& grid, int i, int j) {
        int ct = 0;
        queue<PII> q;
        q.push({ i, j });
        ct++;
        vis[i][j] = true;

        while (q.size()) {

            auto [a, b] = q.front();
            q.pop();
            for (int k = 0; k < 4; k++) {

                int x = a + dx[k], y = b + dy[k];
                //  cout<<x<<' '<<y<<endl;
                // cout<<grid[x][y]<<endl;
                if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == 1 &&
                    !vis[x][y]) {
                    q.push({ x, y });
                    vis[x][y] = true;
                    ct++;
                    cout << n << ' ';
                }
            }
        }
        ret = max(ret, ct);
    }
};